Sparse Low-Density Parity-Check Codes for Channels with Cross-Talk
نویسندگان
چکیده
Low-density parity-check codes are modified to produce transmissions in which the symbols 1 and 0 are used with different frequencies. These codes are good candidates for multi-user channels with crosstalk, such as optical channels.
منابع مشابه
Error-correction on non-standard communication channels
Many communication systems are poorly modelled by the standard channels assumed in the information theory literature, such as the binary symmetric channel or the additive white Gaussian noise channel. Real systems suffer from additional problems including time-varying noise, cross-talk, synchronization errors and latency constraints. In this thesis, low-density parity-check codes and codes rela...
متن کاملOn the Parity-Check Density and Achievable Rates of LDPC Codes
The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds on the parity-check density are expressed in terms of the gap between the channel capacity and the rate of the codes for which reliable communication is achi...
متن کاملNear Shannon Limit Performance of Low Density Parity Check Codes
We report the empirical performance of Gallager’s low density parity check codes on Gaussian channels. We show that performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of Turbo codes. A linear code may be described in terms of a generator matrix G or in terms of a pari...
متن کاملNear Shannon Limit Performance of Low Density Parity Check Codes Construction 1a. an M by N Matrix (m Rows, N Columns) Is Created at Random with Weight
We report the empirical performance of Gallager's low density parity check codes on Gaus-sian channels. We show that performance substantially better than that of standard convolu-tional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of Turbo codes. A linear code may be described in terms of a generator matrix G or in terms of a pa...
متن کاملDecay of Correlations for Sparse Graph Error Correcting Codes
The subject of this paper is transmission over a general class of binary-input memoryless symmetric channels using error correcting codes based on sparse graphs, namely low-density generator-matrix and low-density parity-check codes. The optimal (or ideal) decoder based on the posterior measure over the code bits, and its relationship to the sub-optimal belief propagation decoder, are investiga...
متن کامل